// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi 
// Source File Name:   yc.java

package com.zelix;

import java.io.PrintWriter;
import java.util.*;

// Referenced classes of package com.zelix:
//            wg, it, fh, wb, 
//            nh, mt, lu, ou, 
//            cv, tb

public class yc
    implements wg
{

    protected Vector a;
    protected nh b;
    protected PrintWriter c;
    protected it d;
    protected Hashtable e;
    protected Hashtable f;
    protected Hashtable g;
    protected Hashtable h;
    protected Hashtable i;
    protected Hashtable j;

    public yc(it it1, Vector vector, nh nh1)
    {
        d = it1;
        a = vector;
        b = nh1;
        c = nh1.n();
    }

    public final boolean a()
    {
        return e.size() == 0;
    }

    public final boolean b()
    {
        return f.size() == 0;
    }

    public boolean c()
    {
        return i.size() == 0;
    }

    public Enumeration a(String s)
    {
        return d.c(s);
    }

    public final Enumeration b(String s)
    {
        Enumeration enumeration = d.d(s);
        if(enumeration == null)
            return null;
        else
            return enumeration;
    }

    public final boolean a(String s, String s1)
        throws wb
    {
        return d.a(s, s1);
    }

    public final boolean b(String s, String s1)
        throws wb
    {
        return d.b(s, s1);
    }

    public final Enumeration e()
    {
        mt amt[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        amt = new mt[f.size()];
        enumeration = f.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        amt[k++] = (mt)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(amt);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public Enumeration f()
    {
        lu alu[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        alu = new lu[j.size()];
        enumeration = j.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        alu[k++] = (lu)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(alu);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public Enumeration g()
    {
        ou aou[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        aou = new ou[h.size()];
        enumeration = h.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        aou[k++] = (ou)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(aou);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public final Enumeration h()
    {
        mt amt[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        amt = new mt[e.size()];
        enumeration = e.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        amt[k++] = (mt)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(amt);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public Enumeration i()
    {
        lu alu[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        alu = new lu[i.size()];
        enumeration = i.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        alu[k++] = (lu)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(alu);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public Enumeration j()
    {
        ou aou[];
        Enumeration enumeration;
        int k;
        boolean flag;
        flag = tb.b;
        aou = new ou[g.size()];
        enumeration = g.keys();
        k = 0;
        if(!flag) goto _L2; else goto _L1
_L1:
        aou[k++] = (ou)enumeration.nextElement();
_L2:
        if(!enumeration.hasMoreElements())
            return new cv(aou);
        if(true) goto _L1; else goto _L3
_L3:
    }

    public final boolean a(mt mt1)
    {
        return f.containsKey(mt1);
    }

    public final boolean c(String s)
    {
        fh fh1 = fh.b(s);
        if(fh1 != null)
        {
            mt mt1 = fh1.c();
            return f.containsKey(mt1);
        } else
        {
            return false;
        }
    }

    public final boolean c(mt mt1)
    {
        return e.containsKey(mt1);
    }

    public boolean a(lu lu1)
    {
        return j.containsKey(lu1);
    }

    public boolean a(ou ou1)
    {
        return h.containsKey(ou1);
    }
}
